منابع مشابه
VC-Dimension of Exterior Visibility of Polyhedra
In this paper, we address the problem of finding the minimal number of viewpoints outside a polyhedron in two or three dimensions such that every point on the exterior of the polyhedron is visible from at least one of the chosen viewpoints. This problem which we call the minimum fortress guard problem (MFGP) is the optimization version of a variant of the art-gallery problem (sometimes called t...
متن کاملVC-Dimension of Visibility on Terrains
A guarding problem can naturally be modeled as a set system (U ,S) in which the universe U of elements is the set of points we need to guard and our collection S of sets contains, for each potential guard g, the set of points from U seen by g. We prove bounds on the maximum VC-dimension of set systems associated with guarding both 1.5D terrains (monotone chains) and 2.5D terrains (polygonal ter...
متن کاملOn the VC-Dimension of Visibility in Monotone Polygons
We show that the VC-dimension of visibility on the boundary of a monotone polygon is exactly 6. Our lower bound construction matches the best known lower bound for simple polygons.
متن کاملVC dimension of ellipsoids
We will establish that the vc dimension of the class of d-dimensional ellipsoids is (d +3d)/2, and that maximum likelihood estimate with N -component d-dimensional Gaussian mixture models induces a geometric class having vc dimension at least N(d + 3d)/2.
متن کاملTeaching Dimension versus VC Dimension
In this report, we give a brief survey of various results relating the Teaching Dimension and VC-Dimension. The concept of Teaching Dimension was first introduced by Goldman and Kearns, 1995 and Sinohara and Miyano, 1991. In this model, an algorithm tries to learn the hidden concept c from examples, called the teaching set, which uniquely identifies c from the rest of the concepts in the concep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2004
ISSN: 0162-8828
DOI: 10.1109/tpami.2004.1273987